DOWNS AND TWO-PARTY CONVERGENCE

Downs and Two-party Convergence

We take as our starting point the insights of Downs (1957) into twoparty competition. A careful reading of Downs offers a much more sophisticated and nuanced portrait of the factors affecting party differentiation than the simplistic notion that, in plurality elections, we ought to expect party convergence to the views of the median voter. Later scholars have built on Downsian ideas to see what...

The Problem of Party Convergence

Tutorial Notes on One-party and Two-party Gaussian States

Communicated by (xxxxxxxxxx) Gaussian states — or, more generally, Gaussian operators — play an important role in Quantum Optics and Quantum Information Science, both in discussions about conceptual issues and in practical applications. We describe, in a tutorial manner, a systematic operator method for first characterizing such states and then investigating their properties. The central numeri...

Lecture 4 -general Secure Two Party and Multi Party Computation

In this lecture we will discuss secure two party and multi party computation. Assume we have m parties. Each party Pi holds a private value xi, and all parties want to compute some agreed upon function f (x2, x2..., xm). We will discuss and sketch the security requirements from such a computation and what difficulties arise from those requirements. We will present a protocol, but will not prove...

Improved two-party and multi-party purification protocols

We present an improved protocol for entanglement purification of bipartite mixed states using several states at a time rather than two at a time as in the traditional recurrence method. We also present a generalization of the hashing method to n-partite cat states, which achieves a finite yield of pure cat states for any desired fidelity. Our results are compared to previous protocols.